Draft Proceedings of the 24 Th Symposium on Implementation and Application of Functional Languages ( Ifl 2012 )
نویسنده
چکیده
Higher-order functions that are polymorphic in a monad make highly flexible modular components. Unfortunately, the combination of an unknown function parameter and a polymorphic monad are detrimental to reasoning. This paper shows how to eliminate both the function parameter and the polymorphism. The resulting characterization is amenable to reasoning. The approach is based on a judicious combination of the coroutine monad transformer and monad morphisms.
منابع مشابه
Preproceedings of the 22 nd Symposium on Implementation and Application of Functional Languages ( IFL 2010 )
The paper presents preliminary results in automatic inference of size invariants, and of ranking functions proving termination of functional programs, by adapting linear techniques developed for other languages. The results are promising and allow to solve some problems left open in previous works on automatic inference of safe memory bounds.
متن کاملComputer Science at Kent Implementation and Application of Functional Languages 19 th International Symposium , IFL 2007
Safe is a first-order eager functional language with facilities for programmer-controlled destruction and copying of data structures and is intended for compile-time analysis of memory consumption. In Safe, heap and stack memory consumption depends on the length of recursive calls chains. Ensuring termination of Safe programs (or of particular function calls) is therefore essential to implement...
متن کاملKent Implementation and Application of Functional Languages 19 th International Symposium , IFL 2007
Safe is a first-order eager functional language with facilities for programmer-controlled destruction and copying of data structures and is intended for compile-time analysis of memory consumption. In Safe, heap and stack memory consumption depends on the length of recursive calls chains. Ensuring termination of Safe programs (or of particular function calls) is therefore essential to implement...
متن کاملBracker, Jan and Nilsson, Henrik (2016) Polymonad programming in Haskell. In: 27th 2015 International Symposium on Implementation and Application of Functional Languages - IFL
Polymonads were recently introduced by Hicks et al. as a unified approach to programming with different notions of monads. Their work was mainly focused on foundational aspects of the approach. In this article, we show how to incorporate the notion of polymonads into Haskell, which is the first time this has been done in a full-scale language. In particular, we show how polymonads can be repres...
متن کاملThe Peter Landin prize
The Peter Landin prize honours the best paper presented at each year’s International Symposium on the Implementation and Application of Functional Languages (IFL). It has been awarded every year since 2003, and covers a range of topics including functional operating systems, static analysis for cost information of functional programs, techniques to improve array processing for data locality and...
متن کامل